منابع مشابه
Randomized Anagram revisited
When compared to signature-based Intrusion Detection Systems (IDS), anomaly detectors present the potential advantage of detecting previously unseen attacks, which makes them an attractive solution against zero-day exploits and other attacks for which a signature is unavailable. Most anomaly detectors rely on machine learning algorithms to derive a model of normality that is later used to detec...
متن کاملAnaGram: protein function assignment
SUMMARY AnaGram is a web service for protein function assignment based on identity detection of small significant fragments (protomotifs) that can act as modular pieces in peptide construction. The system is able to assign function by finding correlations between protomotifs and functional annotations contained in SWISS-PROT and Medline databases. In addition, function ontologies are used for h...
متن کاملAnagram-free colorings of graphs
A sequence S is called anagram-free if it contains no consecutive symbols r1r2 . . . rkrk+1 . . . r2k such that rk+1 . . . r2k is a permutation of the block r1r2 . . . rk. Answering a question of Erdős and Brown, Keränen constructed an infinite anagram-free sequence on four symbols. Motivated by the work of Alon, Grytczuk, Ha luszczak and Riordan [2], we consider a natural generalisation of ana...
متن کاملAnagram solving: does effort have an effect?
The purpose of these studies was to explore the role of effort in remembering anagrams and their solutions. In Experiment 1, we compared the effects on memory of copying words, typing them as solutions for easy anagrams, or typing them as solutions for difficult anagrams. Solving anagrams involved more effort than did simply typing words, as indexed by response time. However, this effort facili...
متن کاملAnagram-free colourings of graph subdivisions
An anagram is a word of the form WP where W is a non-empty word and P is a permutation of W . A vertex colouring of a graph is anagram-free if no subpath of the graph is an anagram. Anagram-free graph colouring was independently introduced by Kamčev, Łuczak and Sudakov and ourselves. In this paper we introduce the study of anagram-free colourings of graph subdivisions. We show that every graph ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Information Processing and Management
سال: 2010
ISSN: 0021-7298,1347-1597
DOI: 10.1241/johokanri.53.284